TIGHT-TARDY PROGRESSIVE IDLING-FREE 1-MACHINE PREEMPTIVE SCHEDULING WITH JOB PRIORITY WEIGHTS BY HEURISTIC’S EFFICIENT JOB ORDER INPUT
نویسندگان
چکیده
Background. In setting a problem of minimizing total weighted tardiness by the heuristic based on remaining available and processing periods, there are two opposite ways to input data: job release dates given in either ascending or descending order. It was recently ascertained that scheduling few equal-length jobs is expectedly faster order, whereas 30 70 1.5 % 2.5 For number between roughly 90 250, order again results shorter computation times. case when have different lengths, significance much lower. On average, gives tiny advantage time. This decreases as increases. Objective. The goal ascertain whether significant using for lengths with priority weights. Job efficiency will be studied tight-tardy progressive idling-free 1-machine preemptive scheduling. Methods. To achieve said goal, computational study carried out purpose estimate averaged time both orders dates. First, estimated series problems. Then, each instance this series, weights, dates, due reversed making thus respective input, which well. Results. lower than without priorities. With assigning becomes further “dithered”, adding randomly scattered weights partially randomized believed give up 100 jobs. However, advantage, if any (being tinier random priorities), quickly vanishes Conclusions. better compose problems would closer priorities, where saved can counted hours. Even scattered, it recommended artificially “flatten” them. When artificial manipulations over periods impossible, use jobs, more although substantial benefits not expected case.
منابع مشابه
On Job Fairness in Non-Preemptive Parallel Job Scheduling
Fairness is an important issue for parallel job scheduling policies, but has been ignored in most of previous studies. In this paper, we consider two different styles of job fairness: FCFS and EQ. Commonly used summary statistics are applied to different job measures to evaluate the fairness under a wide range of non-preemptive parallel job scheduling policies, including priority backfill polic...
متن کاملPreemptive Job-Shop Scheduling Using Stopwatch Automata
In this paper we show how the problem of job-shop scheduling where the jobs are preemptible can be modeled naturally as a shortest path problem defined on an extension of timed automata, namely stopwatch automata where some of the clocks might be freezed at certain states. Although general verification problems on stopwatch automata are known to be undecidable, we show that due to particular pr...
متن کاملPreemptive Job Scheduling in Star Graph Networks
In this paper we develop a feasibility algorithm for preemptively scheduling a given set of jobs with dimension and time requirements on a star graph network of given size with a given deadline. We show that the algorithm runs in O(n log n) time where n is the number of jobs.
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملScheduling with job dependent machine speed
The power consumption rate of computing devices has seen an enormous increase over the last decades. Therefore computer systems must make a trade-off between performance and energy usage. This observation has led to speed scaling, a technique that adapts the speed of the system to balance energy and performance. Fundamentally, when implementing speed scaling, an algorithm must make two decision...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: KPI science news
سال: 2021
ISSN: ['2617-5509', '2663-7472']
DOI: https://doi.org/10.20535/kpisn.2020.4.209129